A Note on Amalgams of Inverse Semigroups
نویسنده
چکیده
منابع مشابه
Amalgams of Free Inverse Semigroups
We study inverse semigroup amalgams of the form S U T where S and T are free inverse semigroups and U is an arbitrary nitely generated inverse subsemigroup of S and T. We make use of recent work of Bennett to show that the word problem is decidable for any such amalgam. This is in contrast to the general situation for semigroup amalgams, where recent work of Birget, Margolis and Meakin shows th...
متن کاملA Topological Approach to Inverse and Regular Semigroups
Work of Ehresmann and Schein shows that an inverse semigroup can be viewed as a groupoid with an order structure; this approach was generalized by Nambooripad to apply to arbitrary regular semigroups. This paper introduces the notion of an ordered 2-complex and shows how to represent any ordered groupoid as the fundamental groupoid of an ordered 2-complex. This approach then allows us to constr...
متن کاملOn the decidability of the word problem for amalgamated free products of inverse semigroups
We study inverse semigroup amalgams [S1, S2;U ], where S1 and S2 are finitely presented inverse semigroups with decidable word problem and U is an inverse semigroup with decidable membership problem in S1 and S2. We use a modified version of Bennett’s work on the structure of Schützenberger graphs of the R-classes of S1 ∗U S2 to state sufficient conditions for the amalgamated free products S1 ∗...
متن کاملSemigroups with inverse skeletons and Zappa-Sz$acute{rm e}$p products
The aim of this paper is to study semigroups possessing $E$-regular elements, where an element $a$ of a semigroup $S$ is {em $E$-regular} if $a$ has an inverse $a^circ$ such that $aa^circ,a^circ a$ lie in $ Esubseteq E(S)$. Where $S$ possesses `enough' (in a precisely defined way) $E$-regular elements, analogues of Green's lemmas and even of Green's theorem hold, where Green's relations ${mathc...
متن کاملAmalgams of inverse semigroups and reversible two-counter machines
We show that the word problem for an amalgam [S1, S2;U,ω1, ω2] of inverse semigroups may be undecidable even if we assume S1 and S2 (and therefore U) to have finite R-classes and ω1, ω2 to be computable functions, interrupting a series of positive decidability results on the subject. This is achieved by encoding into an appropriate amalgam of inverse semigroups 2-counter machines with sufficien...
متن کامل